| 1. | A complete bipartite graph is a simple bipartite graph with bipartition .
完全偶图是具有二分类的简单偶图。 |
| 2. | Factor - covered and factor - deleted bipartite graphs
二部图的因子覆盖与因子消去 |
| 3. | On the list colorings of the bipartite graphs and euler graphs
关于二部图和欧拉图的列表着色 |
| 4. | The matrix algorithm of search a maximum matching in bipartite graph
求偶图最大匹配的矩阵算法 |
| 5. | Independent cycles in bipartite graphs
二分图中相互独立的圈 |
| 6. | A class of degree - maximal non - hamilton balanced bipartite graphs
一类度极大的非哈密尔顿简单平衡二部图 |
| 7. | Fractional factors of bipartite graphs
偶图的分数因子 |
| 8. | In the skeleton matching , an novel approach based on weighted optimal bipartite graph matching theory is also presented
在骨架匹配方面，论文提出了一种基于加权最优二分图匹配技术的骨架匹配技术。 |
| 9. | It is pointed out that the design of sequences of degree distribution in bipartite graphs is one of the most important problems in constructing low - density erasure codes
其中二部图度序列的设计是构造低密度纠删码的最关键问题之一。 |
| 10. | In chapter 3 , orthogonal factorizations of graphs , including [ 0 , k1 ] m - factorizations orthogonal to a subgraph and orthogonal factorizations of bipartite graphs , is mainly studied
第三章研究了图的正交因子分解问题，主要包括与任意图正交的[ 0 ， k _ i ] _ l ~ m -因子分解和二分图的正交因子分解 |
